binary sort造句

• The following example shows a typical binary sort order
  下面的示例演示了典型的二进制排序顺序。
• Binary sort order is case sensitive and accent sensitive
  二进制排序顺序既区分大小写，也区分重音。
• A typical binary sort order is
  典型的二进制排序顺序为：
• Option compare binary , which produces a typical binary sort order
  排序的，这将产生一个典型的二进制排序顺序。
• Sets the string comparison method to a strict binary sort order
  将字符串比较方法设置为使用严格的二进制排序顺序。
• Performs a binary sort
  执行二进制排序。
• The bin2 sort order suffix can be used for binary sorting of unicode data
  Bin2排序顺序后缀可用于unicode数据的二进制排序。
• Both bin and bin2 binary sorts are supported for the new 90 windows collations
  Bin和bin2二进制排序都受新的90 windows排序规则支持。
• Binary sort tree
  二叉排序树
• For non - unicode data , bin2 will use comparisons identical to binary sorts
  对于非unicode数据， bin2将使用与二进制排序相同的比较方式。
• In microsoft windows , the code page being used determines the binary sort order
  在microsoft windows中，使用的代码页决定二进制排序顺序。
• A binary collation in analysis services defines the language locale and the ansi code page to be used , enforcing a binary sort order
  Analysis services中的二进制排序规则强制使用二进制排序顺序，定义了要使用的语言区域设置和ansi代码页。
• The exception is in setup where you do not specify a collation name for windows collations , but instead specify the collation designator , and then select check boxes to specify binary sorting or dictionary sorting that is either sensitive or insensitive to either case or accents
  例外情况是：在安装过程中没有为windows排序规则指定排序规则名称，而是指定排序规则指示器，然后选择复选框以指定区分或不区分大小写和重音的二进制排序或字典排序。
• In this paper , a lot of researches and exploration are applied to studying the universality and expansibility of hardware and the arithmetic design and code optimization of software . especially , all of the following arithmetics or conceptions are worked out in the research of software design : self - adaptable compression arithmetic based on dictionary model for data collection system , similarity full binary sort tree , a optimized quick search arithmetic and an improved arithmetic of multiplication in the floating - point operation . and all of the arithmetic are designed with mcs - 51 assembly language . the quick search arithmetic , in which merits of both binary search and sequence search are used fully , are based on the specialty of preorder traversal in similarity full binary sort tree
  特别在软件设计研究中，提出了适用于数据采集系统的数据压缩算法? ?基于字典模型的自适应压缩算法；提出了类满二叉排序树的定义；提出了基于类满二叉排序树的先序遍历特性的最优化快速查找算法，它充分利用了折半查找和顺序查找各自的优点；提出了浮点运算乘法的改进算法；并在mcs - 51汇编语言层次上对所有的算法加以实现。